Learning to Code: Print Nodes at Distance K From Node

Written by learncodingwithme | Published 2022/06/03
Tech Story Tags: mobile-application-development | mobile-app-development | programming | software-development | learn-to-code | print-nodes | binary-tree | problem

TLDRWe have an arbitrary binary tree, a node of that tree, and also an integer: 'K.' We need to print all such nodes which have a distance K from the given node and return the list of these nodes. You can check out this problem here as well: Print Nodes at Distance k from Node. The distance between the two nodes in a binary tree is defined as the number of connections/edges in the path between the two nodes.via the TL;DR App
no story
Written by learncodingwithme | Tech Expert
Published by HackerNoon on 2022/06/03
ABOUTHow hackers start their afternoons. We publish tech stories and build publishing software.

READEntirely free library read by hundreds of millions to learn anything about any technology.

WRITEHackerNoon elevates quality technology writing far and wide across the interwebs.

PARTNERHackerNoon works directly with tech companies to place ads by content relevancy