Binary Tree

Правка en1, от Abito, 2024-05-03 22:23:48

Many graph problems have subtasks where the graph is a binary tree (edge between i and i*2, i and i*2+1), however I often struggle with them. Does anyone know a useful resource that discusses different techniques to approach such a problem/subtask?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Abito 2024-05-03 22:24:14 9 Tiny change: 'raph is a binary tr' -> 'raph is a complete binary tr'
en1 Английский Abito 2024-05-03 22:23:48 259 Initial revision (published)