Breaking News: Grepper is joining You.com. Read the official announcement!

Tree : Top View

Grieving Gazelle answered on June 18, 2022 Popularity 8/10 Helpfulness 1/10

answer Tree : Top View

related Tree : Top View

Tree : Top View

Comment

def topView(root):
    d = {}
    def traverse(root, key, level):
        if root:
            if key not in d:
                d[key] = [root, level]
            elif d[key][1] > level:
                d[key] = [root, level]           
            
            traverse(root.left, key-1, level +1)
            traverse(root.right, key+1, level + 1)
            
    traverse(root, 0, 0)
    for key in sorted(d):
        print(d[key][0], end = " ")

Popularity 8/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: python tree view

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Grieving Gazelle

0 Answers Avg Quality 2/10

Closely Related Answers

Tree : Top View

Comment

def topView(root):
    d = {}
    def traverse(root, key, level):
        if root:
            if key not in d:                # when new key is added
                d[key] = [root, level]
            elif d[key][1] > level:         # for movement inside tree
                d[key] = [root, level]           
            
            traverse(root.left, key-1, level +1)
            traverse(root.right, key+1, level + 1)
            
    traverse(root, 0, 0)
    for key in sorted(d):
        print(d[key][0], end = " ")

Popularity 8/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: view python tree pyth

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Grieving Gazelle

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Tree : Top View

Contents

More Related Answers

Tree : Top View

Closely Related Answers

Tree : Top View

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.