Python bigtree leftmost and rightmost leaves

Question

I am trying to find the left most leaf and right most leaf in the bigtree node , here is my code

from bigtree import nested_dict_to_tree, print_tree

path_dict = {
   "name": "a",
   "points": 100,
   "side":'H',
   "children": [
      {
         "name": "b",
         "points": 50,
         "side":'L',
         "children": [
            {"name": "d", "points": 40,"side":'L'},
            {"name": "e", "points": 20,"side":'R'},
         ],
      },
      {"name": "c", "points": 60,"side":'R' ,
      
         "children": [
            {"name": "f", "points": 40,"side":'L'},
            {"name": "g", "points": 20,"side":'R'},
         ]},
   ],
}

tree_root = nested_dict_to_tree(path_dict)

print_tree(tree_root)

for below output i need to get 'd' as right most node and 'g' as left most node

a
├── b
│   ├── d
│   └── e
└── c
    ├── f
    └── g

Answer 1

The leftmost node is referring to the first child of every node, starting from root node, while the rightmost node is referring to the last child of every node, starting from root node.

The children of a node can be directly accessed as such,

leftmost_node = tree_root.copy()
while leftmost_node.children:
    leftmost_node = leftmost_node.children[0]

rightmost_node = tree_root.copy()
while rightmost_node.children:
    rightmost_node = rightmost_node.children[-1]

This will result in

leftmost_node
# Node(/a/b/d, points=40, side=L)

rightmost_node
# Node(/a/c/g, points=20, side=R)

Source: I'm the author of bigtree :)