Fa1987
BAN USERvoid PrintTop(Node n, int cur = 0, ref int leftMost = 0, ref int rightMost = 0, bool isTop = true)
{
if(cur == 0 && isTop)
{
console.writeLine(n.value);
}
if(c < leftMost)
{
console.writeLine(n.value);
leftMost = c;
}
if(c > rightMost)
{
console.writeLine(n.value);
rightMost = c;
}
if(n.right != null)
PrintTop(n.right, cur+1, leftMost, rightMost, false);
if(n.left != null)
PrintTop(n.left, cur-1, leftMost, rightMost, false);
}
RepRutviOrtiz, Android Engineer at AMD
I am experienced in teaching other translators through one-on-one mentoring and professional development courses. I am passionate about Unbinding spell ...
Repdennahood, Top mobile application Development Company in India at Arista Networks
Je suis Denna, une rédactrice professionnelle avec une expérience complète et de solides atouts en rédaction et en rédaction Web ...
Repgoamgivheler, Accountant at Lava
I am working as a nurse in Bali Boer Cafarius. I enjoy relationships with patients and their families. It has ...
RepHenryMelvin, Korean Air Change Flight at AMD
Hello, everybody! My name is Henry,I am a picture-drawer.Art drawing & painting classes for adults, kids, teens.We have ...
Here is a recursive based solution
- Fa1987 March 22, 2017