c++ - What is left and right node where node may > 2 -


I do not understand what left is and right The node in the tree.

Suppose I have such a structure,

  struct rect {void visit () {} std :: vector & lt; Rect *> Organ; }; What is    

left and what is right here? Does it exist here? If so, how can I determine that w / c is rest and W / C is correct?

I want to cross them with root (post-sequence)

Is this right? Zero Post Order (Riket * Rect) {if (rect == nullptr) return; (Auto & amp; i: Promotion :: Adapter :: Reverse (Rect-> Component)) (Poster (I);} Rect-> Travel ();}

but the left and right nodes are not here?

there is no left and right (unless That your rectangles are not sorted by the x-axis position, which is not shown).

Comments

Popular posts from this blog

python - how we can use ajax() in views.py in django? -

matlab - Using loops to get multiple values into a cell -

python - Sequence Pattern recognition with Pybrain -